Ideals of independence
نویسندگان
چکیده
منابع مشابه
Robustness and Conditional Independence Ideals
We study notions of robustness of Markov kernels and probability distribution of a system that is described by n input random variables and one output random variable. Markov kernels can be expanded in a series of potentials that allow to describe the system’s behaviour after knockouts. Robustness imposes structural constraints on these potentials. Robustness of probability distributions is def...
متن کاملMonomial ideals and independence of IΣ2 DRAFT
We show that a miniaturised version of Maclagan’s theorem on monomial ideals is equivalent to 1−Con(IΣ2) and classify a phase transition threshold for this theorem. This work highlights the combinatorial nature of Maclagan’s theorem. Monomial ideals play an important role in commutative algebra and algebraic combinatorics. Maclagan’s theorem has several applications in computer algebra (See, fo...
متن کاملCharacteristic-independence of Betti numbers of graph ideals
In this paper we study the Betti numbers of Stanley-Reisner ideals generated in degree 2. We show that the first six Betti numbers do not depend on the characteristic of the ground field. We also show that, if the number of variables n is at most 10, all Betti numbers are independent of the ground field. For n = 11, there exists precisely 4 examples in which the Betti numbers depend on the grou...
متن کاملOn ideals of ideals in $C(X)$
In this article, we have characterized ideals in $C(X)$ in which every ideal is also an ideal (a $z$-ideal) of $C(X)$. Motivated by this characterization, we observe that $C_infty(X)$ is a regular ring if and only if every open locally compact $sigma$-compact subset of $X$ is finite. Concerning prime ideals, it is shown that the sum of every two prime (semiprime) ideals of e...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2019
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-019-00669-8